Closeness Coefficients between Euclidean-Embeddable Homologous Configurations
نویسنده
چکیده
Measurement of closeness between homologous configurations is often of interest. For configurations that can be embedded onto the Euclidean space, we attempted to develop closeness coefficients between corresponding Euclidean coordinate matrices. A suitable closeness coefficient was required to satisfy the following five properties: 1) It must range between 0 and 1; 2) It must be invariant over translation, rotation and dilation of coordinate matrices, namely, TRDinvariance; 3) It must be one between equivalent coordinate matrices; 4) It must be zero between coordinate matrices whose corresponding configurations are orthogonal; and 5) It must be symmetric between any pair of coordinate matrices. We showed that the following two closeness coefficients derived based on different approaches were equivalent and both satisfied the five required properties: 1) a goodness of fit coefficient GF based on minimum distance fitting of coordinate matrices by translation, rotation and dilation; and 2) the Gower-Lingoes-Schönenman coefficient RGLS based on the maximum of correlations of coordinate matrices over rotation. In addition, the Escoufier’s RV coefficient was also shown to satisfy all the five properties. Finally, RGLS, or equivalently GF, and RV were all shown to be a function of centered forms or singular values of coordinate matrices.
منابع مشابه
On links of vertices in simplicial $d$-complexes embeddable in euclidean $2d$-space
We consider d-dimensional simplicial complexes which can be PL embedded in the 2ddimensional euclidean space. In short, we show that in any such complex, for any three vertices, the intersection of the link-complexes of the vertices is linklessly embeddable in p2d ́ 1q-dimensional euclidean space. From this observation, we derive a new upper bound on the total number of d-simplices in an embedda...
متن کاملHunting for Wolves in Speaker Recognition
Identification and selection of speaker pairs that are difficult to distinguish offers the possibility of better focusing speaker recognition research, while also reducing the amount of data needed to estimate system performance with confidence. This work aims to predict which speaker pairs will be difficult for automatic speaker recognition systems to distinguish, by using features that charac...
متن کاملOn the comparison and representation of fuzzy partitions
A fuzzy partition assigns to each among n objects a distribution over a categories. Elementary linear algebraic methods permit to introduce and investigate concepts and properties such as a) variance and inertia decomposition; b) coarseand fine-graining (nestedness); c) iteration of fuzzy partitions; d) stability of a group in regard to another partition; e) (euclidean embeddable) dissimilariti...
متن کاملA Clustering-Oriented Closeness Measure Based on Neighborhood Chain and Its Application in the Clustering Ensemble Framework Based on the Fusion of Different Closeness Measures
Closeness measures are crucial to clustering methods. In most traditional clustering methods, the closeness between data points or clusters is measured by the geometric distance alone. These metrics quantify the closeness only based on the concerned data points' positions in the feature space, and they might cause problems when dealing with clustering tasks having arbitrary clusters shapes and ...
متن کاملGeographical Information Retrieval with Ontologies of Place
Geographical context is required of many information retrieval tasks in which the target of the search may be documents, images or records which are referenced to geographical space only by means of place names. Often there may be an imprecise match between the query name and the names associated with candidate sources of information. There is a need therefore for geographical information retri...
متن کامل